Fuzion • Library Modules • base • container • Binary_Heap_Queue • enqueue_dequeue

container.Binary_Heap_Queue.enqueue_dequeue

(elem T)

[Redefinition of container.Mutable_Priority_Queue.enqueue_dequeue]

enqueue elem and then dequeue (return and remove) the highest priority element

this is more efficient (factor 2) than an enqueue followed by a dequeue

Time complexity: amortized O(log n) or O(log n) when staying within min_size

Postcondition

post then debug 5 : check_heap_property

redefines:

container.Mutable_Priority_Queue.enqueue_dequeue

0.097dev (GIT hash 6a5de4939ddf29875c1d9a706508d9bfd0cd7ca9)

last changed: 2026-06-09